Voronoi regions of lattices, second moments of polytopes, and quantization

نویسندگان

  • John H. Conway
  • N. J. A. Sloane
چکیده

Ah&act-If a point is picked at random inside a regular simplex, octahedron, 600-cell, or other polytope, what is its average squared distance from the centroid? In n-dimensional space, what is the average squared distance of a random point from the closest point of the lattice A, (or D,, , En, A: or D,*)? The answers are given here, together with a description of the Voronoi (or nearest neighbor) regions of these lattices. The results have applications to quantization and to the design of signals for the Gaussian channel. For example, a quantizer based on the eight-dimensional lattice Es has a mean-squared error per symbol of 0.0717 when applied to uniformly distributed data, compared with 0.0&333 . . for the best one:dimensional quantizer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Lattices for Quantization

A training algorithm for the design of lattices for vector quantization is presented. The algorithm uses a steepest descent method to adjust a generator matrix, in the search for a lattice whose Voronoi regions have minimal normalized second moment. The numerical elements of the found generator matrices are interpreted and translated into exact values. Experiments show that the algorithm is sta...

متن کامل

On the Voronoi Regions of Certain Lattices *

The Voronoi region of a lattice Ln R is the convex polytope consisting of all points of I that are closer to the origin than to any other point of Ln. In this paper we calculate the second moments of the Voronoi regions of the lattices E6*, E7*, K12, A16 and A24. The results show that these lattices are the best quantizers presently known in dimensions 6, 7, 12, 16 and 24. The calculations are ...

متن کامل

The Cell Structures of Certain Lattices*

The most important lattices in Euclidean space of dimension n ≤ 8 are the lattices A n (n ≥ 2 ), D n (n ≥ 4 ), E n (n = 6 , 7 , 8 ) and their duals. In this paper we determine the cell structures of all these lattices and their Voronoi and Delaunay polytopes in a uniform manner. The results for E6 ∗ and E7 ∗ simplify recent work of Worley, and also provide what may be new space-filling polytope...

متن کامل

Wideband LSF quantization by generalized voronoi codes

Presented a method for quantizing the wideband line spectrum frequencies (LSF) with a specific class of near-ellipsoidal lattice codes referred to as “generalized Voronoi codes”. Optimization procedures are described with respect to a weighted mean-square error (WMSE). The lattices D16, RE16 or R 16 are applied to quantize the LSF with no frequency splitting. Results indicate that near-ellipsoi...

متن کامل

Optimum Quantization and Its Applications

Minimum sums of moments or, equivalently, distorsion of optimum quantizers play an important role in several branches of mathematics. Fejes Tóth’s inequality for sums of moments in the plane and Zador’s asymptotic formula for minimum distortion in Euclidean d-space are the first precise pertinent results in dimension d ≥ 2. In this article these results are generalized in the form of asymptotic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1982